Mathematical Foundation of Computer Science
Details of the course ↓
Relation ⇗
- Types and composition of relations ☆ Pictorial representation of relations ☆ Equivalence relations ☆ Partial ordering relation ☆ Posets ☆ Hasse Diagram
Function ⇗
- Types ☆ Composition of functions ☆ Recursively defined functions
Algebraic Structures ⇗
- Semi group ☆
monoid ☆ Group ☆ Abelian group ☆ properties of group ☆ subgroup and their properties ☆ Cyclic group ☆ Cosets ☆ lagrange's theorem ☆ Permutation groups ☆ Homomorphism ☆ Isomorphism ☆ Automorphism of groups (Definition and examples)
Preposition Logic ⇗
- Preposition ☆ Basic Logical operations ☆ Tautologies ☆ Contradictions ☆ Algebra of Proposition ☆ Logical Implication ☆ Logical equivalence ☆ Normal forms ☆ Inference Theory ☆ Predicates and quantifiers
Pre-Requisite → Basics of math, Number systems
Subject Area → Mathematics
Objective → To familiarize students with the Mathematical Foundation of Computer Science
Course Outcome
- A student who successfully fulfills the course requirements will be able to:
- Explain the theoretical limils on computational solutions of undecidable and inherently
complex problems.
- Describe concrete examples of computationally undecidable or inherently infeasibble problems
from different fields.
- Understand formal definitions of machine models, classical and quantum.
- Prove the undecidability or complexity of a variety of problems.
- Understand the issue of whether there are limits of computability.
